A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
نویسنده
چکیده
We give a deterministic O(hn1+1/h)-time (2h)-approximation nonadaptive algorithm for 1-median selection in n-point metric spaces, where h ∈ Z+ \ {1} is arbitrary. Our proof generalizes that of Chang [2].
منابع مشابه
A lower bound for 1-median selection in metric spaces
Consider the problem of finding a point in an n-point metric space with the minimum average distance to all points. We show that this problem has no deterministic nonadaptive o(n)-query (4− Ω(1))-approximation algorithms.
متن کاملARTUR CZUMAJ AND CHRISTIAN SOHLER Title: ESTIMATING THE WEIGHT OF METRIC MINIMUM SPANNING TREES IN SUBLINEAR TIME
In this paper we present a sublinear-time (1+ε)-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time of the algorithm is Õ(n/εO(1)). Since the full description of an n-point metric space is of size Θ(n2), the complexity of our algorithm is sublinear with respect to the input size. Our algorithm is almost optimal as i...
متن کاملA lower bound for metric 1-median selection
Consider the problem of finding a point in an n-point metric space with the minimum average distance to all points. We show that this problem has no deterministic o(n 2)-query (4 − Ω(1))-approximation algorithms.
متن کاملFacility Location in Sublinear Time
In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location problem, in the case of uniform costs and uniform demands, and in which every point can open a facility. By exploiting the fact that we are approximating the optimal cost without computing an actual solution, we give the first algori...
متن کاملSublinear-Time Approximation for Clustering Via Random Sampling
In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum k-clustering, and balanced k-median. For all these problems we consider the following simple sampling scheme: select a small sample set of points uniformly at random from V and then run some approximation algorithm on this sample set to compute an approximati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 602 شماره
صفحات -
تاریخ انتشار 2015